import java.util.HashMap;
import java.util.Map;

/**
 * @author Sebastian
 * @version 2.0
 * @date 2024/8/12 10:49
 */
// 两数之和
    // https://leetcode.cn/problems/two-sum/description/
public class Solution1 {
    public int[] twoSum(int[] nums, int target) {
        Map<Integer, Integer> map = new HashMap<Integer, Integer>();
        for (int i = 0; i < nums.length; i++) {
            if (map.containsKey(target - nums[i])) {
                return new int[]{i, map.get(target - nums[i])};
            }
            map.put(nums[i], i);
        }
        return new int[]{};
    }
}
